CONTRIBUTORS

ABSTRACT

Narratives about Brazil's nuclear program are distorted by supporters and critics alike. In Brazil, the national nuclear infrastructure is undergoing a period of expansion, with plans to build new nuclear power plants and industrial-scale fuel production facilities. While Brazil's leaders herald the nuclear sector as a triumph for indigenous science and technology, foreigners view the nuclear program as a dangerous legacy of the military regime. This discrepancy becomes even more apparent in discussions about the ongoing construction of Brazil's first nuclear powered submarine. Brazil's military touts the submarine as a symbol of political status, economic growth, and military might. But from abroad, the military's involvement in nuclear development is considered unnecessary, worrisome, and even irresponsible. These narratives—often incomplete or selective—have polarized discussions about Brazil's nuclear submarine program and caused considerable political antagonism during safeguards negotiations. This article works to dispel myths, highlight legitimate concerns, and explain historical perspectives that shed light on some difficulties that can be anticipated in future negotiations.     

在Vs．net集成环境下创建带卸载的安装程序

创建安装程序是一件很简单的事,Vs.net提供了创建安装程序的向导,开发人员能够轻松地创建一个便于用户使用的安装程序。而按向导创建的安装程序没有为用户提供相应的卸载程序或快捷方式,为用户带来许多不便。以示例的形式详细介绍如何在Vs.net集成环境下创建带卸载的安装程序。     

基于POPS和PSR的美军里程碑节点审查方法

里程碑节点审查是美军装备采办过程中的核心控制手段。选取美军在该领域应用的最具代表性的项目成功可能性评审方法(Probability of Program Success,POPS)和项目支持评审方法(Program Support Review,PSR),围绕任务目标归纳出方法的主要思路,从程序步骤、评审内容框架等方面深入探究方法的特点,并从应用条件、使用范围、优点和局限性等方面进行对比分析,最后提出启示建议,为优化我军节点审查方法、提升装备采购过程管控能力提供借鉴和参考。     

D运输问题在物资调度中的应用

D运输问题是含离散目标约束的目标规划问题.首先将此多目标问题转化为单一目标问题,使之简化为传统的运输问题,然后使用一种相对简单的方法求解.最后结合一个实例,讨论了D运输问题在物资调度中的应用.     

战场物资快速运输的指挥控制

针对战场快速物资运输的指挥控制问题,提出一种基于线性规划的方法。根据供求双方物质的供应和需求总量、地理空间上的位置以及运输工具的运载能力等信息,制订一个满足供求双方物资总运载量,并以运送所有物资耗费时间为最小的优化目标,改进了传统运输问题模型。仿真分析表明,该方法为实现战场物资快速运输的指挥控制提供了有价值的参考。     

Minimizing sums and products of linear fractional functions over a polytope

In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametric transformation of the objective function serves as an efficient method for calculating global minima of these nonconvex minimization problems if the number of linear fractional terms in the objective function is less than four or five. It will be shown that the Charnes–Cooper transformation plays an essential role in solving these problems. Also a simple bounding technique using linear multiplicative programming techniques has remarkable effects on structured problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 583–596, 1999     

Solution algorithms for the parallel replacement problem under economy of scale

We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998     

C~3I系统中软件的程序设计方法问题

软件的可靠性是Ｃ￣３Ｉ系统成败的关键之一,用规范和程序分离的办法设计软件,其可靠性无法得到保证。该文阐述了应研究形式化程序设计方法的意见,以及目前在这一领域尚存在的困难和解决的途径。     

研究生课表的计算机自动编排

针对研究生课程安排特点,提出并建立了一个研究生课程的计算机排课系统,同时讨论了此系统的数据结构和具体实现环境.通过建立排课的约束条件和排课相容判断准则,进一步阐述了研究生课表编排的计算机具体实现原则及其方法.